Routing with Topology Aggregation in Bandwidth-Delay Sensitive Networks

Routing is a process of finding a path from a source node to a target node. The time and space needed to find a route increase with the network size. In order to deal with the scaling problem, large networks are often structured hierarchically by grouping nodes into different domains. The internal topology of each domain is then aggregated into a simple topology that reflects the cost of routing across that domain. This process is called topology aggregation. In delay-bandwidth sensitive networks, traditional approaches, using aggregated topology, represent each link as a delaybandwidth pair which creates a point on the delay-bandwidth plane. The major contribution of this paper is a novel quality of service parameter representation with new corresponding aggregation algorithm and QoS-aware routing protocol. Our simulation results show very good performance in terms of success ratio and crankback ratio metrics.